Probing Polygons Minimally Is Hard
نویسندگان
چکیده
Belleville, P. and T.C. Shermer, Probing polygons minimally is hard, Computational Geometry: Theory and Applications 2 (1993) 255-265. Let r be a set of convex unimodal polygons in fixed position and orientation. We prove that the problem of determining whether k finger probes are sufficient to distinguish among the polygons in f is NP-complete for two types of finger probes. This implies that the same results hold for most interesting classes of polygons on which finger probes can be used.
منابع مشابه
Probing Convex Polygons with Half-planes1
A half-plane probe through a polygon measures the area of intersection between a half-plane and the polygon. We dev elop techniques based on xray probing to determine convex n-gons in 7n + 7 half-plane probes. We also show n + 1 half-plane probes are sufficient to verify a specified convex polygon and prove linear lower bounds for determination and verification.
متن کاملComputing the Fréchet Distance Between Polygons with Holes
We study the problem of computing the Fréchet distance between subsets of Euclidean space. Even though the problem has been studied extensively for 1-dimensional curves, very little is known for d-dimensional spaces, for any d ≥ 2. For general polygons in R, it has been shown to be NP-hard, and the best known polynomial-time algorithm works only for polygons with at most a single puncture [Buch...
متن کاملErgodicity of Two Hard Balls in Integrable Polygons
We prove the hyperbolicity, ergodicity and thus the Bernoulli property of two hard balls in one of the following four polygons: the square, the equilateral triangle, the 45 − 45 − 90◦ triangle or the 30− 60− 90◦ triangle.
متن کاملCovering Grids and Orthogonal Polygons with Periscope Guards
Gewali, L.P. and S. Ntafos, Covering grids and orthogonal polygons with periscope guards, Computational Geometry: Theory and Applications 2 (1993) 309-334. The problem of finding minimum guard covers is NP-hard for simple polygons and open for simple orthogonal polygons. Alternative definitions of visibility have been considered for orthogonal polygons. In this paper we try to determine the com...
متن کاملWatchman routes in the presence of a pair of convex polygons
Given a set of polygonal obstacles in the plane, the shortest watchman route problem asks for a closed route from which each point in the exterior of the polygons is visible to some point along the route. This problem is known to be NP-hard and the development of an eecient approximation algorithm is still open. We present an O(n 2) time algorithm for computing the shortest watchman route for a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Geom.
دوره 2 شماره
صفحات -
تاریخ انتشار 1992